Re ning a Parallel Algorithm For Calculating
نویسندگان
چکیده
String players know that bowing properly is the hardest skill they have to learn. In other work 4], we develop an algorithm that calculates bowings for BowTech, a project that supports string performers. This algorithm takes a signiicant amount of time to execute (in our second test case, over an hour for the implementation, written in Ada). We have implemented the algorithm in GpH, a parallel superset of Haskell, and measured the quality of output on six pieces of music. The parallel program has been reened using the GranSim simulator and measured on two parallel architectures: a shared memory multiprocessor and a network of workstations.
منابع مشابه
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملPrototyping N-body Simulation in Proteusz
This paper explores the use of Proteus, an architecture-independent language suitable for prototyping parallel and distributed programs. Proteus is a highlevel imperative notation based on sets and sequences with a single construct for the parallel composition of processes communicating through shared memory. Several di erent parallel algorithms for N-body simulation are presented in Proteus, i...
متن کاملRe ning Action Systems within
Action systems is a formalism designed for the construction of parallel and distributed systems in a stepwise manner within the reene-ment calculus. In this paper we show how action systems can be derived and reened within a mechanical proof tool, the B-Tool. We describe how action systems are embedded in B-Tool. Due to this embedding we can now develop parallel and distributed systems within t...
متن کاملPrototyping High-Performance Parallel Computing Applications in Proteus
This paper explores the use of Proteus, an architecture-independent language suitable for prototyping time-sensitive parallel and distributed programs. Proteus is a high-level imperative notation based on sets and sequences with succinct yet powerful constructs for the parallel composition of processes communicating through shared memory. Several di erent parallel algorithms for N-body simulati...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کامل